Online 2d Arbitrary Sized Bin Packing Optimization Using 2pdc Heuristic: a Genetic Approach

نویسنده

  • S. K. Rajesh Kanna
چکیده

This paper presents a Heuristic Genetic Algorithm (HGA) for optimizing two dimensional (2D) arbitrary sized heterogeneous box packing into a container, by considering practical constraints facing in the shipment container loading industries. Objective of this research is to pack heterogeneous boxes of varying length, width and constant height into a container of standard dimension, without violating major practical constraints to obtain a real time feasible packing pattern. The number of boxes will vary with time and the module accepts those boxes entered during processing which is commonly called as online packing. HGA is developed to maximize the container volume utilization and inturn profit. It significantly improves the search efficiency with less computational time and loads most of the heterogeneous boxes available at that time into the container by considering its optimal position and orientation. In general, HGA in comparison with the traditional genetic algorithm is substantially better and more satisfactory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3d Arbitrary Sized Bin Packing Optimization Using 2pdc Heuristic: A Adaptive Genetic Approach

This paper presents a Heuristic Genetic Algorithm (HGA) for optimizing three dimensional (3D) arbitrary sized heterogeneous boxes into a container, by considering practical constraints facing in the shipment container loading industries. Objective of this research is to pack heterogeneous boxes of varying length, width and height into a container of standard dimension, without violating major p...

متن کامل

A new metaheuristic genetic-based placement algorithm for 2D strip packing

Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...

متن کامل

Evolutionary Approach for Optimizing 3D Heterogeneous Bin Packing Problems

This paper presents a combinational Hybrid Genetic Algorithm (HGA) with packing tuning approach for solving Three Dimensional (3D) Single container arbitrary sized heterogeneous bin packing optimization problem, by considering practical constraints in the shipment container loading industries. Aim of this paper is to (i) pack 3D arbitrary sized heterogeneous bins in to a container. (ii) Improve...

متن کامل

Optimization of heterogeneous Bin packing using adaptive genetic algorithm

This research is concentrates on a very interesting work, the bin packing using hybrid genetic approach. The optimal and feasible packing of goods for transportation and distribution to various locations by satisfying the practical constraints are the key points in this project work. As the number of boxes for packing can not be predicted in advance and the boxes may not be of same category alw...

متن کامل

Optimization of heterogeneous Bin packing using adaptive genetic algorithm

This research is concentrates on a very interesting work, the bin packing using hybrid genetic approach. The optimal and feasible packing of goods for transportation and distribution to various locations by satisfying the practical constraints are the key points in this project work. As the number of boxes for packing can not be predicted in advance and the boxes may not be of same category alw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012